Перевод и анализ слов искусственным интеллектом
На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:
- как употребляется слово
- частота употребления
- используется оно чаще в устной или письменной речи
- варианты перевода слова
- примеры употребления (несколько фраз с переводом)
- этимология
imprimitive set - перевод на русский
математика
импримитивное множество
![The [[natural numbers]] <math>\mathbb{N}</math> are contained in the [[integers]] <math>\mathbb{Z}</math>, which are contained in the [[rational numbers]] <math>\mathbb{Q}</math>, which are contained in the [[real numbers]] <math>\mathbb{R}</math>, which are contained in the [[complex numbers]] <math>\mathbb{C}</math>](https://commons.wikimedia.org/wiki/Special:FilePath/NumberSetinC.svg?width=200 "The [[natural numbers]] <math>\mathbb{N}</math> are contained in the [[integers]] <math>\mathbb{Z}</math>, which are contained in the [[rational numbers]] <math>\mathbb{Q}</math>, which are contained in the [[real numbers]] <math>\mathbb{R}</math>, which are contained in the [[complex numbers]] <math>\mathbb{C}</math>")
математика
конечное подмножество
Википедия
In mathematics, a permutation group G acting on a non-empty finite set X is called primitive if G acts transitively on X and the only partitions the G-action preserves are the trivial partitions into either a single set or into |X| singleton sets. Otherwise, if G is transitive and G does preserve a nontrivial partition, G is called imprimitive.
While primitive permutation groups are transitive, not all transitive permutation groups are primitive. The simplest example is the Klein four-group acting on the vertices of a square, which preserves the partition into diagonals. On the other hand, if a permutation group preserves only trivial partitions, it is transitive, except in the case of the trivial group acting on a 2-element set. This is because for a non-transitive action, either the orbits of G form a nontrivial partition preserved by G, or the group action is trivial, in which case all nontrivial partitions of X (which exists for |X| ≥ 3) are preserved by G.
This terminology was introduced by Évariste Galois in his last letter, in which he used the French term équation primitive for an equation whose Galois group is primitive.
